منابع مشابه
Følner Tilings for Actions of Amenable Groups
We show that every probability-measure-preserving action of a countable amenable group G can be tiled, modulo a null set, using finitely many finite subsets of G (“shapes”) with prescribed approximate invariance so that the collection of tiling centers for each shape is Borel. This is a dynamical version of the Downarowicz–Huczek– Zhang tiling theorem for countable amenable groups and strengthe...
متن کاملThe Jacobsthal Sequences in Finite Groups
Abstract In this paper, we study the generalized order- Jacobsthal sequences modulo for and the generalized order-k Jacobsthal-Padovan sequence modulo for . Also, we define the generalized order-k Jacobsthal orbit of a k-generator group for and the generalized order-k Jacobsthal-Padovan orbit a k-generator group for . Furthermore, we obtain the lengths of the periods of the generalized order-3 ...
متن کاملOn spectral approximation, Følner sequences and crossed products
In this article we review first some of the possibilities in which the notions of Følner sequences and quasidiagonality have been applied to spectral approximation problems. We construct then a canonical Følner sequence for the crossed product of a concrete C∗-algebra and a discrete amenable group. We apply our results to the rotation algebra (which contains interesting operators like almost Ma...
متن کاملOn Ordered Polycyclic Groups
It has been asserted that any (full) order on a torsion-free, finitely generated, nilpotent group is defined by some F-basis of G and that the group of o-automorphisms of such a group is itself a group of the same kind: Examples provided herein demonstrate that both of these assertions are false; however, it is proved that the group of o-automorphisms of an ordered, polycyclic group is nilpoten...
متن کاملGeneration of polycyclic groups
Polycyclic groups are one of the best understood class of groups. For example most of the decision problems are decidable in this class, see [7]. It seems surprising therefore that it is still an open problem whether there exists an algorithm which finds d(G) for any polycyclic group G (given by say a set of generators and relations). This is unknown even in the case when G is virtually abelian...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista Matemática Iberoamericana
سال: 1995
ISSN: 0213-2230
DOI: 10.4171/rmi/189